Resource pooling in a blade cluster switching center server

ABSTRACT

The present invention relates to a switching center server comprising:
         a blade cluster with a plurality of blades,   a plurality of pooled resources accessible by said plurality of blades for handling a call, and   a master provided on one of the blades centrally coordinating the usage of the pooled resources, the master as a central instance being responsible for allocation, de-allocation and maintenance of the pooled resources. At outage of one or more blades, the invention provides mechanisms to keep impacts on ongoing calls to a minimum and to keep pooled resources available to the remaining blades.

RELATED APPLICATIONS

The present Application is a continuation of U.S. patent applicationSer. No. 12/993,589, which was filed on Feb. 8, 2011, which is anational stage application of PCT/EP2008/004076, filed May 21, 2008, thedisclosures of each of which are incorporated herein by reference intheir entirety.

TECHNICAL FIELD

This invention relates to a switching center server handling calls. Theinvention relates especially, but not exclusively, to a mobile serviceswitching center server (MSC-S).

BACKGROUND

A typical architecture for an existing high capacity MSC server is aserver structure having a blade cluster structure with a plurality ofblades. Transmission lines that carry payload are terminated in mediagateways (MGw). The switching of these resources is controlled by theMSC server (MSC-S).

Time division multiplex terminations (TDM terminations) as they are usedin contemporary telecommunication systems are not well-suited to becontrolled by a blade cluster server because neither the call controlsignaling nor the media gateway control signaling provides support for amulti-blade architecture. Before a resource such as a termination can beused for a call, coordination of exclusive usage must be performedbetween the different blades of the switching center server.Furthermore, signaling messages need to be routed to the blade thathandles the respective call.

Ephemeral terminations are better suited for a multi-blade architecture.The seizure of termination is coordinated by the media gateway. There isno need for inter-blade coordination on the MSC server side. Signalingmessages need to be routed to the blade that handles the respectivecall. BICC (bearer independent call control) uses ephemeral terminationsbut requires coordination of call instance codes (CIC) on the MSC serverside since they are a common resource of all blades.

With the above-described technology, it is difficult to share TDMterminations and CICs amongst several blades. The range of available TDMcircuits and for BICC the range of call instance codes has to bepartitioned. In this case, each partition is administratively assignedto a particular MSC server blade.

However, the partitioning of resources has the drawback that thepartitioning inhibits the efficient use of user plane circuits. If ablade fails, the resources that are dedicated to a failing blade areunavailable for other traffic. Furthermore, it is more difficult toconfigure the MSC server compared to a system that does not need topartition the TDM circuits. Especially when blades are added or removedfrom the cluster, re-partitioning of the resources assigned to the otherblades needs to be performed. The number of blades in active state canchange for example due to outage of individual blades or in case theserver performance is increased by adding new blades. If the number ofcircuits to be partitioned is only little higher than the number ofblades, even distribution of connectivity to the blades becomesdifficult. If there are fewer circuits to be partitioned than there areblades in the cluster, connectivity cannot be provided to all blades.

SUMMARY

In view of the above-discussed drawbacks, a need exists to provide aswitching center server having a blade structure that allows anefficient use of resources such as user plane circuits and a simplifiedadaption to changes in the number of blades present in the server, bothfrom capital expenditure as well as operational expenditure point ofview This need is met by the features of the independent claims. In thedependent claims, preferred embodiments of the invention are described.

According to one aspect of the invention a switching center server isprovided comprising a blade cluster with a plurality of blades.Furthermore, a plurality of resource pools is provided accessible bysaid plurality of blades for handling a call. In addition, for eachresource pool a dedicated master is provided on one of the bladescentrally coordinating the usage of the pooled resources. Theabove-described switching center server is advantageous as it allows ascalable set of blades in a blade cluster server to share resourcepools. Sharing is performed without partitioning and with a singleinstance, i.e. the master, for the pooled resources responsible for theusage of the resources, e.g. allocation, de-allocation and maintenance.

The set of circuits, channels, and user plane terminations are examplesfor pooled resources that should be accessible for call handling on anyblade. The switching center server of the invention avoids thededication of subsets of these resources to individual blades by havingthe master coordinating the usage of the pooled resources performedcentrally.

For trunks a route master may be provided for each set of circuits thathave the same properties. TDM terminations have a fixed administeredrelationship to a CIC. Each route has a master instance coordinatingselection and release of CICs that are connected to the route. Themaster considers selection types that are applicable for the route inquestion. Coordination of maintenance procedure comprising handling ofmaintenance massages is performed by the route master.

An access master may be provided for each ISDN access. For IDSN accessTDM terminations have a fixed administered relationship to a channel.Each primary rate access has a master coordinating selection and releaseof connected channels. This master, called the access master, considershunting types that are applicable for the access in question. Thecoordination of maintenance procedures comprising handling ofmaintenance messages are performed by the access master. Accordingly,for each route or each access a master instance may be provided, eachmaster instance controlling a pool of shared resources.

According to one embodiment of the invention, a call controller isfurthermore provided on one of the blades controlling the resources forthe duration of the call. During the duration of a call the usedterminations in the media gateway may be controlled by the blade onwhich the call controller is provided. The call controller may requestcontrol over resources from the route/access master and may return thecontrol over resources to said master if the resources are not neededanymore. Maintenance procedures such as a status change and auditing maybe coordinated on a media gateway level by a media gateway master.

A blade and a blade cluster can fail due to hardware or software faults.Failure means that the blade is no longer available for call processingand maintenance handling. These faults can be of temporary or permanentnature. The invention provides high retainability, meaning that callsremain intact to the greatest extent possible. Failure of the bladehosting the master function for any resource used for a call does notaffect established calls.

Preferably the blade cluster is designed in such a way that theinformation about the used resources for a call is kept on two differentblades. By keeping the information redundant on two different blades ata time the following advantages are achieved. A first advantage is theavailability aspect meaning that the pooled resources remain availableto the remaining blades in the cluster even when the blade that hoststhe master performs a recovery action that can retain calls fulfillingcertain stability criteria. Another advantage is the integrity aspectmeaning that a failure of an individual blade is hidden from other nodesin the network except for release of resources due to disconnection ofcalls that were controlled by the failed blade. There is no massresetting of unused resources at single blade failure.

The call controller maintains the information about the used resourcesfor the call. The master instance as primary source additionally knowswhich resources are used by any blade. In case the master and the callcontroller are provided on two different blades, the information aboutthe used resources is provided on two different blades. If the masterand the call controller reside on the same blade, a buddy is used onanother blade, the buddy containing information about the resources usedby the master.

According to another aspect of the invention, a blade status informationunit is provided determining the status of the different blades. Thisblade status information unit informs at a status change of one bladethe other blades of said status change. This blade status informationunit can be designed in such a way that a blade status information unitis provided on each blade, the different blade status information unitsof the different blades being interconnected and exchanging informationabout the status changes of each blade.

Furthermore, a group communication service unit may be providedcontrolling the delivery of messages between blades in such a way thatmessages are delivered in the same order to the plurality of blades.Users on one blade that receive a message can be sure that the messageis delivered to users on all other blades that are part of the quorum aswell. Additionally, each blade is aware which other blades are part ofthe quorum.

As indicated above, a blade of the cluster can fail due to hardware orsoftware faults. Accordingly, a master provided on a failing blade maybe lost. A master present on a failing blade loses the master role. Forthe creation of a new master a coordinator may be provided creating thenew master replacing the master present on a failed blade. Preferablythe coordinator additionally decides on which blade to allocate the newmaster. The coordinator may additionally create a new buddy replacing abuddy present on a failed blade, the coordinator additionally decidingon which blade to allocate the new buddy. Preferably the coordinatortakes into account the computing load of the different blades for theallocation of a new master or a new buddy. Thus, an adequatedistribution of the computing load between the different blades can beachieved.

In order to recover a failing blade, a blade recovery unit may beprovided on each blade carrying out a recovery procedure in case of ablade failure. Dependent on the recovery mechanism applied by a failingblade, calls that are controlled by a temporarily failing blade may beretained. The blade recovery unit can decide which of the calls handledby the failing blade to retain and which of the calls not to retain andtransmits at the end of the recovery procedure information about theresources used for retained calls and the resources of which control isreturned to the master. The not retained calls are disconnected andrelated resources are released by the master upon reception of saidinformation from the failing blade. For the blade recovery,configuration data may be kept on all different blades. It is thereforerobust against multi-blade failures. Should a blade lose memory in afailure situation, the blade recovery unit copies the data necessaryfrom a blade that is intact.

The invention furthermore relates to a method for controlling aswitching center server comprising the steps of providing pooledresources accessible to said plurality of blades and comprising the stepof coordinating usage of the pooled resources for said call by saidplurality of blades by the master. For the duration of a call, the callcontrol is handled by a call controller which sets up the call,supervises the call, disconnects the call, requests control overresources from the route/access master and returns the control to saidmaster if resources are not needed anymore. Accordingly, the informationabout the used resources is present on the blades where the callcontroller and the master reside on. Preferably, the resourceinformation is generally controlled in such a way that the informationabout the used resources is present on more than one blade.

In an additional step the status of the blades is detected wherein incase of a status change of one blade the other blades are informed ofthe status change of said one blade. By detecting the status change of ablade, a blade failure is detected. In an additional step it may bedetected whether a recovery procedure is carried out for said blade. Ifthis is not the case all resources controlled by said failed blade canbe released to be used for other calls. The resources of the failedblade are reset. In case a single blade fails, a copy of all informationis present on another blade. In case a recovery procedure is carried outon the failed blade, the master is informed about the resources used forcalls that are not retained after the recovery procedure so that themaster can then reset the resources of the not retained calls. When themaster receives information which CICs/channels are no longer used fromblades that have carried out a blade recovery, the master then resetsthose CICs/channels that are no longer used and may send GCP (GatewayControl Protocol) subtract commands to the media gateway concerning therelated TDM and ephemeral terminations.

When no calls of the failing blade are retained, the CICs/channels andconnected TDM terminations that have been used by the failed blade arereset by the master, ephemeral terminations are subtracted by the mediagateway master using the wildcarding mechanism.

When it is detected that a master was present on a failed blade, a newmaster is created and a first list of resources used by each blade istransmitted from each other blade to the new master. It may now happenthat the master and the call controller for a call reside on the sameblade. In this case the buddy is informed about state changes such asbusy condition of the CICs or channels due to regular traffic handling.Accordingly, in case the master blade and the call controller blade areidentical, the buddy contains the information which resources the masterhad used. Consequently, in case call controller and master are presenton the same failing blade, the buddy, respectively the blade on whichthe buddy is provided, transmits a second list of used resources used bythe call controller of the failed blade to the new master. If thefailing blade does not perform a recovery action with call retaining,the new master can reset all resources that are present on the secondlist and re-use them immediately.

Each blade receives notification about state changes of the other bladesin the cluster. The master and the buddy roles that were assigned to thefailing blade are now assigned to different blades. Each blade sends alist of CICs/channels that it has leased to the new master. The bladethat so far hosted the buddy of the master on the failed bladeadditionally sends the second list of CICs/channels that the master onthe failing blade had leased to the call controller collocated on thesame blade. A new buddy may be created for each of the new masters andbe updated with the busy data of the resources that are currently leasedby users on the blade the new master resides on as well as the datareceived from the previous buddy. The new master and the media gatewaymaster may then perform resetting of devices and terminations asdescribed above.

In case the buddy is present on a failed blade, the master being alive,a new buddy is created and the current master sends a copy of the listof CICs/channels that are controlled by its own blade to the new buddy.There is no impact on traffic handling or maintenance activities.

Should the master and one more blade fail at the same time, each of theremaining blades sends to the new master a list of CICs/channels that ithas leased. The new master has no information which circuits have beenleased by call controllers on the two failing blades. If none of thefailing blades performs a recovery action with call retaining, the newmaster resets all CICs/channels that are not present on any listreceived from the remaining blades and can re-use them immediately.

As mentioned above, calls may be retained at blade failure. In case ofsuch blade recovery the no longer used circuits are eventually reset bythe master. A recovering blade transmits lists of still used and nolonger used resources to the master only after finishing the recoveringprocedure. Until reception of these lists, the master cannot reset theresources used by the failed blade as it is not known which calls willpossibly be retained the recovery procedure on the failed blade. Uponreception of said list containing CICs/channels that are no longer used,the master resets the CICs/channels contained in that list and canre-use them.

If one blade performs recovery procedure of the kind with callretaining, and it was hosting a master, then a new master is immediatelyassigned on a different blade. Each of the remaining blades sends to thenew master a list of CICs/channels that it has leased. The buddy now hasthe information which circuits the call controller of the failing bladehad used. Through the fact that the buddy additionally transmits thesecond list of resources used by the call controller on the failingblade that hosted the master, the new master then knows which resourcesare currently used and which resources are not used. The new master canimmediately re-use resources that are not contained on any of said listsreceived from other blades and that are not used by a call controllerco-located on the same blade, since the new master knows that theseresources are currently not in use. The new master will treat resourcesleased by the failing blade as used until it receives the list ofno-longer used resources from that blade when it finishes the recovery.Upon reception of said list containing CICs/channels that are no longerused, the master resets the CICs/channels contained in that list and canre-use them.

If the blade, which performs recovery procedure of the kind with callretaining, was hosting a master, and if the buddy were not present, thenthe new master could during the entire duration of the recoveryprocedure of the failed blade not lease out any resources that are notincluded in the lists from the remaining blades. The reason is that thenew master would not know which of the non-reported CICs/channels havebeen leased by the recovering blade and which CICs/channels have beenidle. In this situation the master would be limited to the presentlyused resources which become available after a call has been released.For these resources the master definitely knows that the releasedresources can be used for other calls. This would reduce the number ofresources available in the pool and increase blocking probability,especially when the pool usage level is low at the time of the failureevent.

The information of the buddy helps to avoid the limitation of theavailable pooled resources, as the new master receives the informationwhich resources were used by the failing blade. The new master can resetall resources not used by other blades, except for the resources used bythe failing blade, as some of the resources may be used by retainedcalls. After the recovery procedure the new master is informed about theretained and not retained calls. The new master can then reset all nolonger used resources of said blade.

In case only one blade is in active state, buddies on other bladescannot be created. Accordingly, when it is detected that more than oneblade is in active state, a buddy can be created for the master onanother blade.

When a new master has to be created for a master present on a failingblade, the following steps may be carried out: first of all, it may bedetermined by the coordinator on which blade to create the new master.In a next step, the coordinator may inform the other blades of thecreation of the new master. The new master may then build a status tableof resources used by each blade so that the other blades can nowtransmit the information to the new master needed by the new master forcoordinating the usage of the pooled resources by the plurality ofblades. The master may then provide a copy of the data related to callcontrol performed by the own blade to the buddy, the buddy informing themaster when it has received and successfully stored the data. Finally,the new master informs the other blades of the completion of thecreation of the master.

For computing resource reasons it may be necessary to move the masterand/or the buddy to other blades.

For the move of a buddy the same steps are carried out as for thecreation of a buddy. The move of a buddy may comprise the followingsteps. In a first step the coordinator determines which buddy should bemoved and to which blade the buddy should be moved. In a next step themaster transmits all data needed by the new buddy to the new buddy, andthe new buddy informs the other blades of the successful completion ofthe move.

Additionally, it may be necessary to move the coordinator. According toone aspect of the invention, the coordinator is provided on the bladewith the smallest age rank meaning which is in active state for thelongest time. Preferably, a move of the coordinator controlling the moveor the creation of a new master does not influence the move or creationof the new master.

In case seizure requests for resources are received during move of amaster, these seizure requests are buffered and, after completion of thetransfer, are transmitted to the new master. In case a failure isdetected for the new master before the completion of the transfer, themove is aborted.

In order to assure that, when a new blade is added to the blade clusterthe newly added blade is coordinated with the other blades the currentstatus and the allocation of masters and buddies are transmitted fromanother blade to the new active blade.

BRIEF DESCRIPTION OF THE DRAWINGS

In the following, the invention will be described with reference to theaccompanying drawings, in which

FIG. 1 shows a switching center server with a blade cluster structureessentially coordinating the usage of resources by a master,

FIGS. 2 a and b show an example of a blade cluster with three blades andthe allocation of call control and master,

FIG. 3 shows a blade structure giving an overview over the resourceinformation provided on the different blades,

FIG. 4 shows a blade structure with three blades and differentpermutations of three routes and usage of resources,

FIG. 5 shows a blade structure with four blades and allocation of masterand buddy roles at a blade failure of one blade without call retaining,

FIG. 6 shows a blade structure with a transfer of data to a new masterfor the structure of FIG. 5,

FIG. 7 shows the blade structure of FIG. 5 with a transfer of data tonew buddies,

FIG. 8 shows a flowchart for the creation of a new master,

FIG. 9 shows the flowchart for buffering of service requests by the userduring move of master,

FIG. 10 shows a state machine of master movement,

FIG. 11 shows a flowchart with a blade changing state during move ofmaster,

FIG. 12 shows a flowchart showing a successful move of a buddy,

FIG. 13 shows a state machine for a buddy and

FIG. 14 shows a flowchart during move of buddy.

FIG. 15 shows a blade structure with four blades and allocation ofmaster and buddy roles at a blade failure of one blade performingrecovery without call retaining.

FIG. 16 shows a blade structure with a transfer of data to a new masterfor the structure of FIG. 15,

FIG. 17 shows the blade structure of FIG. 15 with a transfer of data tonew buddies,

FIG. 18 shows the blade structure of FIG. 15 with a transfer of data atthe end of the blade recovery,

DETAILED DESCRIPTION

In FIG. 1 an exemplary embodiment of a mobile service switching server(MSC server) 100 having a cluster structure with a plurality of blades110 is shown. For handling calls, the mobile switching center 100 isconnected to media gateways (MGw) 200. Each MGw comprises a plurality ofterminations 210. As known in the art, a MGw acts as a translation unitbetween separate telecommunication networks the MGws enabling multimediacommunications over multiple transport protocols. The resources such asthe user plane terminations 210 or the set of circuits or channels areexamples for pooled resources that should be accessible by all blades110. The coordination of usage of the pooled resources is performed by amaster 112 as shown in the right part of FIG. 1, where some of themodules provided on a blade are shown in an exemplary embodiment. Fortrunks, the master is a route master coordinating the selection andrelease of CICs that are connected to the route. For each route, a routemaster is provided, each master coordinating a pool of pooled resources.In other words, each pool of shared resources is controlled by thededicated master. For ISDN access, the master is the access mastercoordinating selection and release of channels that are connected to anaccess. Furthermore, a call controller 111 is provided controlling theindividual resources during a call, i.e. sets up the call, supervisesthe call and disconnects the call. Additionally, a blade statusdetermination unit is provided on each blade communicating with theblade status determination units on other blades in order to inform theother blades of a status change, e.g. in case of a failure of a blade.

Additionally, a coordinator 115 may be provided on a blade decidingwhich blades shall host the master 112 or a buddy 113. As will beexplained in detail further below, the buddy 113 is provided in case themaster 112 and the call controller 111 for a certain call are providedon the same blade. Additionally, a group communication service unit 116is provided controlling the delivery of messages between the differentblades in such a way that messages are delivered in the same order toall blades. Furthermore, a blade recovery unit (not shown) is providedinitiating a blade recovery procedure in case of a failure of a blade.Maintenance procedures on media gateway level are coordinated by a mediagateway master not shown in the embodiment of FIG. 1.

It is now possible that the blade 110 of the cluster fails due tohardware or software faults. The blade recovery unit carries out a bladerecovery procedure which is performed on route and PRA level. In thefollowing, when reference is made to all calls or all devices, then thisrefers to all calls that are carried by the route or PRA and all devicesconnected to the route or PRA.

Blade Configuration Change and Failure Recovery

Recovery Preparation

The recovery principle is to restore all functionality that the affectedblade was offering to other blades as soon as possible on a differentblade and not to wait for the affected blade to recover. Recoverypreparation helps to keep the transition time of such functionality toother blades short.

Every route/PRA master has a buddy. In order to reduce inter bladecommunication, the buddy, i.e. the buddy blade, is not informed aboutstate changes (busy condition) of the CICs or channels due to regulartraffic handling, except for calls where route/PRA master blade and callcontrolling blade are identical. For the latter case, the busy stateinformation is stored additionally on the buddy blade and the CIC is notleased to call control until the busy condition is successfully storedby the buddy. This way, traffic related (busy) state information is atany time available at the call controlling blade and one more blade.

FIG. 2 a illustrates by means of an example, which information is storedby the master 112 b, the buddy 113 b and the call controller 111. Onblade 1, the call controller 111 has the entry “R-B; CIC-08”, whichmeans that CIC 08 of route B has been leased. First entry in the list ofbusy circuits of route master B 112 b is “B-1; CIC-08”. This means thatCIC number 08 has been leased to a call controller 111 on blade 1. Sincemaster 112 b and call controller 111 do not reside on the same blade,there is no corresponding entry in the route buddy 113 b on blade 3.

FIG. 2 b shows an example of a case where master 112 a and callcontroller 111 reside on the same blade. On blade 1, the call controller111 has the entry “R-A; CIC-12”, which means that CIC 12 of route A hasbeen leased. First entry in the list of busy circuits of route master A112 a is “B-1; CIC-12”. This means that CIC number 12 has been leased toa call controller on blade 1. Since master 112 a and call controller 111reside on the same blade, the information that CIC 12 has been used to acall controller on blade 1 is also stored by the buddy 113 a thatresides on blade 2.

In FIG. 3 the knowledge of the different blades about the circuitsbelonging to one route is summarized. FIG. 3 shows for each blade thehedged areas indicating the sets of circuits the blade knows the statusof. The large area 130 represents the total number of circuits availablefor said route. The smaller areas 131 represent the leased circuits byeach blade. The area 132 representing the difference of areas 130 and131 represents the idle circuits for said route. In the embodiment shownfour different blades are provided. Blade 1 knows which circuits areleased by blade 1, whereas blade 2 knows the circuits leased by blade 2.In the embodiment shown blade 3 comprises the route master knowing whichcircuits are used by the different blades for that predetermined route.The master provided on blade 3 has information about the circuits leasedby blade 1, by blade 2, by blade 3, by blade 4 and the idle circuits notleased to any call controller. As can be seen, the master also knows thestatus of the unused circuits. In the embodiment shown the buddy iscontained on blade 4. As a consequence, the buddy blade does not onlyknow which circuits are leased by blade 4. Blade 4 in its buddy roleadditionally has the knowledge about the circuits leased by blade 3 incase the call controller for a call is also provided on blade 3 wherethe master is provided. For each call a call controller is provided, andthese call controllers are distributed over the blades. In case the callcontroller for a call using a certain route is provided on the sameblade as the master for said route, the buddy additionally contains theinformation which circuits are leased by the blade where the master isprovided.

MGw masters have no buddy. MGw status information is replicated on allblades. In the following a table is shown indicating how thecall-related information is distributed.

Information Primary Secondary Alternative Route device busy Route MasterCall controller Route Buddy condition PRA device busy PRA master Callcontroller PRA Buddy condition Route device line Route master Everyblade blocking condition Route device other Route master Every bladeblocking condition Maintenance Master Every blade message activities andalarms MGw status MGw master Every blade Termination audit MGw masterEvery blade activities

Primary storage is the place that keeps the information during normaloperation and is used for reference. Secondary storage is the place thatkeeps the information during normal operation for backup purposes. Ifthe primary storage is not available, then the backup storage is used torestore the information in the primary storage. Alternative backup isthe storage location that is used instead of the secondary storagelocation if the primary and secondary storage would otherwise be locatedon the same blade.

Different to what is described above, redundancy cannot be provided ifthere is only one blade handling traffic. In this scenario, there are nobuddies. As soon as one more blade is handing traffic, buddies arecreated. Re-balancing will make sure that masters are evenly distributedwhen two or more blades are in traffic mode.

In FIG. 4, examples show which information is stored by the master, thebuddy and the call controller. First entry in the list of busy circuitsof route master A 112 a is “B-1; CIC-12”. This means that CIC number 12has been leased to a call controller on blade 1. On the same blade, thecall controller has the entry “R-A; CIC-12”, which means that the sameCIC of route A has been leased. Since master 112 a and call controller111 reside on the same blade, the route A buddy 113 a on blade 2 hasalso an entry: “B-1; CIC-12”, indicating that CIC-12 has been leased tocall controller on blade 1.

In the example shown in FIG. 4, the call controller 111-1 on blade 1 hasadditionally leased circuit 25 for route A. As the route master 112 acontaining the information about the busy circuit 25 is also containedon blade 1 to route A, buddy 113 a additionally has the entry of thebusy circuit CIC-25 used by blade 1. The route C buddy 113 c has theentry that on blade 3 the circuit 34 is busy, as the call controller forcircuit 34 and the route C master 112 c are both provided on the sameblade, namely blade 3. The same is true for the route B buddy 113 bcontaining the information that on blade 2 the circuit 18 is busy forroute B, the information that is otherwise provided on blade 2 in thecall controller 111-2 and the route B master 112 b. In the otherexamples shown, the information about leased circuits and busy circuitsis provided on two different blades so that additional information inthe buddy is not needed.

Recovery at Blade Failure

As soon as a blade leaves the active state, any master and buddy rolesit had are lost. Replacements must be established for the roles ofmaster and buddy.

The handling of resources leased by the failing blade is differentdependent on if it is performing a recovery procedure with callretaining or without call retaining. The other blades are informed ifcall that are controlled by the failing blade may be retained.

Actions Performed by the Other Blades at Single Blade Failure

Resetting of Devices and Terminations

Blade Recovery with Loss of Ongoing Calls:

The route master knows which CICs and the PRA master knows whichchannels are used by the failed blade. As soon as it is known that ablade has failed and it does not perform recovery with call retaining,the CICs/channels and connected TDM terminations that have been used bya failed blade are reset by the (new) route/PRA master. Ephemeralterminations are subtracted by the MGw master using the wildcardingmechanism identifying terminations used by the recovering blade.

Blade Recovery Allowing Call Retaining:

The master receives information from the recovering blade about whichCICs/channels are still used and which CICs/channels are no longer used,from a blade that has performed recovery procedure with call retaining.The master then resets those CICs/channels that are no longer used andsends GCP subtract commands to the MGw concerning the related TDM andephemeral terminations. Here, the wildcarding mechanism can not be usedfor subtract of ephemeral terminations.

Media Gateway Master was on Failed Blade

A different blade is assigned the role of MGw master. Ongoing calls arenot affected.

Route/PRA Master was on Failed Blade, Buddy Alive

Each blade receives notification about state change of other blades inthe cluster. The master and buddy roles that were assigned to thefailing blade are now assigned to different blades. Each blade sends afirst list of CICs/channels that it has leased to the new master. Bladesthat so far hosted the buddy to a master on the failed bladeadditionally send a second list of CICs/channels that the masters on thefailing blade had leased to call control collocated on the own blade. Anew buddy will be created for each of the new masters and be updated thebusy data of the CICs/channels that are currently leased by users on theblade the new master resides on as well as data received from theprevious buddy. The new master and the MGw master then perform resettingof devices and terminations as described above.

Buddy was on Failed Blade, Master Alive

A new buddy is created and the current master sends a copy of the listof CICs/channels that are controlled by its own blade to the new buddy.There is no impact on traffic handling or maintenance activities.

Actions Performed by Other Blades at Multi-Blade Failure

No Blade is Performing Blade Recovery with Call Retaining

Master and buddy roles that became vacant due to blade failure arereassigned to other blades.

If two blades fail at the same time, then some devices will have callcontroller and master lost. If no blade is performing a blade recoveryprocedure with call retaining, then the new master can identify whichcircuits/channels are not used by any blade: At creation of a newmaster, all blades send a list of circuits they have leased to the newmaster. The circuits that are not indicated as leased by any blade areeither idle or have been leased by any of the restarting blades, theyare in unknown state.

Due to the dual blade failure, the new master can not determine which ofthese circuits are idle and which of them are leased to calls that aresupposed to be disconnected. It will reset all these circuits/channelsand subtract the respective terminations.

For the period of time that devices are in unknown state, the route/PRAmaster can not lease them out for new calls. Devices that any bladereturns from lease are of known status can be assigned to new callsimmediately.

Any seizure requests that can not be served this way are buffered (FIFO)and processed until devices are available that are known to be IDLE. Atbuffer overflow, the oldest seizure requests are rejected.

A new buddy is allocated for each Route/PRA master that had a buddy on afailed blade. The new buddy will be loaded with busy condition of theCICs/channels that are leased for calls controlled by the blade the(new) master resides on.

One or More Blades are Performing Blade Recovery with Call Retaining

If any blade is performing a recovery procedure that might result incalls to be retained, then no assumption can be made by the activeblades about which circuits/channels leased by it can be reset. It is upto the recovering blade to decide which calls are retained. At the endof the recovery procedure, the master receives information about whichcircuits/channels are to be reset due to call disconnection.

When a blade hosting a master fails at the same time as a differentblade and one or both of them are performing recovery procedure withcall retaining, then the newly allocated master is not able to tellwhich of the circuits that are not reported by the remaining blades areidle and which ones are seized by the blade(s) performing such recoveryprocedure. It can therefore not reset any of these circuits of which thestate is unknown until no more recovery procedures with call retainingare ongoing.

For the period of time that devices are in unknown state, the route/PRAmaster can not lease them out for new calls. Devices that any bladereturns from lease are of known status can be assigned to new callsimmediately unless they are blocked.

Any seizure requests that can not be served this way are buffered (FIFO)and processed until devices are available that are known to be idle. Atbuffer overflow, the oldest seizure requests are rejected.

A new buddy will be determined for those Route/PRA masters that have abuddy on any failed blade. The new buddy will be loaded with busycondition of the CICs/channels that are leased for calls controlled bythe blade the (new) master resides on.

Buddies of lost masters on blades that do perform recovery without callretaining send to the new masters lists of circuits that the lostmasters had leased to collocated call control. The new masters canimmediately reset these circuits, subtract the connected terminationsand re-use them.

Actions Performed by a Blade Performing Recovery with Call Retaining

Role Distribution

A blade performing recovery actions that allow calls to be retainedimmediately looses any master or buddy roles it had before the recoveryhappened. There is no information passed from the recovering blade tothe new master or buddy (or any other blade) during the recovery.

CICs/Channels that do have a Master on a Different but the RecoveringBlade

Any lease of CICs/channels by masters towards the recovering bladeremains valid. That bade itself will determine which calls to retain andwhich ones to disconnect. At the end of the recovery procedure, therecovering blade sends information about which circuits/channels are tobe reset due to call disconnection to the route/PRA master.

The recovering blade can not tell the state of CICs/channels for which aseizure request was sent to the blade where the master resides, but noacknowledgement was received. It could be that the seizure request waslost during the recovery procedure, but it could also be that theacknowledgement was lost. The related calls must be released and theCIC/channel is requested to be released as well. The master will onlyaccept the release of a CIC/channel, if it was received from the sameblade that seized the resource. This precaution is necessary since theCIC/channel might be seized by a different blade, if the suspectedseizure was never performed by the master.

The recovering blade can not tell the state of CICs/channels for which arelease request was sent but no acknowledgement was received. It couldbe that the release request was lost during recovery, but it could alsobe that the acknowledgement was lost. The related calls must be releasedand the recovering blade again requests CIC/channel to be released. Themaster will only accept the release request of a CIC/channel, if it wasreceived from the same blade that seized the resource. This precautionis necessary since the CIC/channel might be seized by a different blade,if the suspected release was performed by the master. The mastertolerates release attempt of a CIC/channel that is not in busy state.

Actions Performed by a Blade Performing Recovery without Call Retaining

Any lease of resources by that blade becomes void. The recovering bladedoes not report any CIC/channels to the master. The recovering bladeclears all calls but does not send reset messages and subtract commands.

Example for Blade Recovery with Call Retaining

The following figures show handling of routes; the handling of PRA isdone according to the same principles.

FIG. 5 shows a cluster with four blades. Blade 2 leaves active state inorder to perform a recovery action. During the recovery, nocommunication with the other blades is possible. The type of recoverydoes not allow any calls controlled by that blade to be retained.

The route A master 112 a resides on blade 1. It resets all circuits thathave been leased to blade 2. In the example, this is only CIC-50. Theroute A master sends a subtract command for the termination connected toCIC-50 of route A to the MGw.

The route C master 112 c resides on blade 3. It resets all circuits thathave been leased to blade 2. In the example, this is only CIC-98. Theroute C master sends a subtract command for the termination connected toCIC-98 of route C to the MGw.

The master role for route B needs to be re-assigned, because it waspreviously assigned to blade 2. It is now assigned to blade 3. Wheneverthe master role is reassigned, the buddy role is reassigned as well. Thebuddy role for route B is now assigned to blade 1.

The buddy role for route A needs to be re-assigned, because it waspreviously assigned to blade 2. It is now assigned to blade 4.

FIG. 6 shows how the new master of route B 112 b now receives the CICstates from call controllers of all blades that are in active state.CIC-36 is leased by the call control 111-3 on the same blade and CIC-08is leased by the call control 111-1 on blade 1.

The old buddy of route B 113 b reports to the new master 112 b of routeB that CIC-18 has been leased to blade 2. In order to keep thisinformation redundant on two blades at any time, the new master passesthis data to the new buddy, see FIG. 7. The old buddy keeps the datauntil the entire role move sequence is successfully completed. The newmaster resets all circuits that had been leased to blade 2. In theexample, this is only CIC-18. The new master sends a subtract commandfor the termination connected to CIC-18 of route A to the MGw.

The new route B master 112 b reports all circuits leased to callcontrollers on the own blade to the new route B buddy 113 b. In theexample shown in FIG. 7 this is CIC-36.

FIG. 7 shows how the master of route A 112 a feeds the data related tocalls controlled by the own blade to its new buddy 113 a. In theexample, this is CIC-12.

Example for Blade Recovery with Call Retaining

This example shows handling of routes; the handling of PRA is doneaccording to the same principles.

FIG. 15 shows a cluster with four blades. Blade 2 leaves active state inorder to perform a recovery action. During the recovery, nocommunication with the other blades is possible. The type of recoveryallows calls controlled by that blade to be retained. Some calls thatare not considered stable will be disconnected. The other blades cannottell which calls will be retained until the recovery of the blade isfinished.

The master of route A 112 a resides on blade 1. It knows all circuitsthat have been leased to blade 2. In the example, this is only CIC-50.The lease continues.

The master of route C 112 c resides on blade 3. It knows all circuitsthat have been leased to blade 2. In the example, this is only CIC-98.The lease continues.

The master role for route B 112 b needs to be re-assigned, because itwas previously assigned to blade 2. It is now assigned to blade 3.Whenever the master role is reassigned, the buddy role is reassigned aswell. The buddy role for route B now assigned to blade 1.

FIG. 16 shows how the new master of route B now receives the CIC statesfrom call controllers of all blades that are in active state. CIC-36 isleased by the call control on the same blade and CIC-08 is leased by thecall control on blade 1.

The old buddy of route B 113 b reports to the new master 112 b thatCIC-18 has been leased to blade 2. The lease continues.

In order to keep this information redundant on two blades at any time,the new master passes this data to the new buddy, see FIG. 17. The oldbuddy keeps the data until the entire role move sequence is successfullycompleted.

The buddy role for route A needs to be re-assigned, because it waspreviously assigned to blade 2. It is now assigned to blade 4. FIG. 17shows how the master of route A 112 a feeds the data related to callscontrolled by the own blade to its new buddy 113 a. In the example, thisis CIC-12.

At the end of the recovery procedure the call controller on blade 2informs the route masters about circuits that should be reset becausethe call that used them was disconnected due to the recovery procedure,see FIG. 18. The respective master will reset such circuits and subtractthe respective termination.

Creation of Master and Buddy

Trigger Point for Creation

When a distributable object is defined on all active blades, thecoordinator decides on which blade to allocate the master and buddyroles. All blades in active state are informed by means of a broadcastedmessage. If only one blade in the cluster is in active state, then nobuddy can be created. In such situation the buddy will be created by thecoordinator later, as soon as a second blade is available.

Another trigger for creation of master and buddy is when the blade thathost the master leaves the active state without a previous successfulmove.

Creation of Master and Buddy is also triggered when the coordinatordecides that an ongoing creation has failed due to timeout.

Allocation Algorithm

The algorithm to allocate master and buddy must fulfill the followingcriteria:

The exchange data for an object must be defined on the target blade

Master and buddy of the same distributed object must never be allocatedon the same blade.

The processing load should be distributed on all blades, so that allblades are loaded to the same percentage of their individual capacity.

Creation of Master and Buddy

The coordinator decides which blades shall host master and buddy. Thesequence is illustrated in FIG. 8. There is no transfer of data from themaster to the buddy for MGws. Steps that do not apply to MGW objects arepointed out in the stepwise description below.

When master and buddy are created, there is no way to known if masterand buddy existed before. Calls may be going on and calls might havebeen disconnected in the absence of master and buddy. Release requestsfor leased resources that are buffered at a call controlling blade mightbe lost due to recovery procedures of that blade. Therefore, thepossibility that circuits and terminations are leased by a failed bladeand would be hanging cannot be excluded. As a remedy, any resource thatdoes not have a known leaser needs to be reset, unless a recovery actionwith call retaining is ongoing on a non-traffic-handling blade.

Step 1: The active blade with the smallest age rank always has thecoordinator role. It determines the blades that shall host the newmaster and the new buddy.

The coordinator then triggers the creation procedure by multicastingNEW_MASTER message to all active blades. The roles are thereby assignedwithout further acknowledgement message.

Step 2: This step does not apply to MGws. The new master is now preparedto receive data from the other blades. The master will compile the datareceived from the other blades to build a complete busy/idle table forall resources it is responsible for.

Step 3: This step does not apply to MGws. With message TRANSFER allblades in active state except for the one hosting the master, providetheir data that the new master needs to perform the master role.

Step 4: This step does not apply to MGws. The master provides a copy ofthe data related to call control on the own blade to the buddy bysending UPDATE_BUDDY.

Step 5: The buddy indicates with BUDDY READY message to the master thatit has received and stored data from the master and that it is ready totake the role of buddy.

Step 6: The new master multicasts CHANGE_MASTER message to all activeblades. Now the new master must reset all resources that might have beenleased by it's predecessor (and possibly other blades that have leftactive state during absence of a master). The new master must wait untilno blade is performing recovery with call retaining and then, dependenton the type of resources it is responsible for, reset all circuits,B-channels or subtract all terminations that are not currently leased byany blade including itself. A windowing mechanism should be implementedto throttle the massive flow of subtract messages in order to preventoverloading of the MGw.

Move of Master and Buddy

General

In order to balance the processor- and inter-blade signaling load, itcan become necessary to move the mastership role for an individualroute, PRA or MGw to a different blade.

Another trigger for move of mastership is that the coordinator detectsthat a blade leaves the active state. The coordinator will then triggermoving of any master or buddy roles, which that blade hosts, to otherblades. If there is no active blade that the master can be moved to,then the old master will eventually cease to exist and the role ofmaster becomes vacant.

Any sequence to move the master to a different blade must be robustagainst unavailability of any blade at any given time. The protocol thatcarries the relevant messages provides means to get a positiveconfirmation that all intended receiver blades have received a certainmessage. A blade returning after failure has to get the latest statusfrom any other blade. Unless the recovering blade plays a vital role inthe move process, such event shall not disrupt the move. The protocolcarrier needs to guarantee cluster global ordering, i.e. messages sentthrough that carrier are always received in the same order on allblades.

In order to reduce the number of potential error scenarios, the numberof messages sent between blades is kept to a minimum.

For the duration of the move of route/PRA master, new calls can not beestablished for the respective route/PRA. The move of MGw master doesnot lead to any traffic disturbance.

A move is initiated from the coordinator blade by multicasting ofMOVE_MASTER. It is terminated either by multicast of CHANGE_MASTER orNOT_MOVED or when one of the blades that are designated for master orbuddy roles leave the active state. Details are described in thefollowing chapters.

If one or more blades are not reachable, or if there is a split brainsituation in the cluster, no broadcast or multicast is possible. Theallocation of masters and buddies will be frozen, because moves canneither be started nor finished. As a consequence, if both master andbuddy fail either simultaneously or sequentially, the role will bevacant and the respective object cannot be used by the system any more.As soon as communication is possible again, the coordinator will triggercreation of master and buddy.

Successful Move of Mastership

The inter-blade communication sequence is the same as for creation ofmaster and buddy, shown in FIG. 8. Upon reception of NEW_MASTER message,the current master suspends its role until the sequence is eithersuccessfully finished or aborted.

During a move sequence, there is no data transferred between old and newbuddy. The new buddy will hold a completely different set of data thanthe old buddy, because the master is allocated on a different blade. Theold buddy will keep the data until the move sequence is terminated;should the sequence be aborted, the role allocations fall back to theassignment that was valid before the move.

Handling of Service Requests During Move of Master

Call processing continues during move of master. During the time thatdata is transferred between old and new master, a call controller mightwant to lease a channel/circuit or to release it. The move proceduremust be designed with special care to avoid inconsistencies that can becaused by modifying data that is being moved to a new blade. The move isonly completed, when the destination has taken the role of master. Untilthen, it can abort at any time due to recovery actions or outage of thedestination blade. Data must remain consistent also in such scenario.

In order to avoid inconsistencies, service requests that are related tothe moved object and impact the transferred data are buffered for theentire duration of the move.

FIG. 9 shows the handling of service requests during move of masterrole. Buffering is performed by the call controlling blade betweenreception of NEW_MASTER and CHANGE_MASTER to the master blade.

Step 1: A seizure can be tried for calls controlled by the old masterblade. The blade waits until reception of CHANGE_MASTER beforeprocessing the request.

Step 2: A seizure can be tried for calls controlled by other blades.That blade waits until reception of CHANGE_MASTER.

Step 3: At reception of CHANGE_MASTER, the call controlling blade thatwas hosting the old master sends buffered SEIZURE_REQUEST messages tothe new master blade.

Step 4: At reception of CHANGE_MASTER, any call controlling blade sendsbuffered SEIZURE_REQUEST messages to the new master blade.

Exceptional Scenarios During Explicit Move of Mastership

The principle is that at any time, all blades have sufficientinformation to determine if the move is still ongoing, or if itterminated successfully or not. FIG. 10 shows the move related statemachine that is maintained on each active blade for all masters. Thetransitions are triggered either by sending or reception of the namedmessages.

In the following the consequences of blade outages and communicationproblems are described in connection with FIG. 11.

If master or buddy fail during the time span that is hatched in FIG. 11,then the move is aborted.

Timeout of Move Operation

All blades run time supervision of every ongoing move operation. Attimeout the coordinator will try to create a new master and buddy byrepeating the procedure starting with MOVE_MASTER. Preferably it willtry to allocate the roles on different blades than before.

Coordinator Role Moves:

The coordinator role only moves if the blade hosting the currentcoordinator leaves active state. Should the coordinator role move at anytime before reception of CHANGE_MASTER, there would be no impact on thesequence of moving the master. All remaining blades in active state havesufficient information to take over the coordinator role at any time.The remaining blade with smallest age rank, i.e. the one that has beenin active state for the longest time, will resume coordination role. Itwill be aware of the ongoing move, since it received the MOVE_MASTERmessage in the same way as all others did. It must not trigger anyadditional rebalancing action before the ongoing move terminates eithersuccessfully or unsuccessfully. It will use the already runningsupervision timers on the own blade for the ongoing move sequences.

New Blade Becomes Active During Move:

A blade that wants to join active state will receive the current statusand allocation of masters and buddies from the blade with the smallestage rank in an ALLOCATION_TABLE message. It will know if a move isongoing and will be included in the recipients list of CHANGE_MASTER,because the new master is made aware of the state change of the new userthrough the cluster group communication service.

Other Blade Changes State During Move:

The fact that a blade that is neither designated for master nor buddyhas changed the blade state does not affect the move sequence.

Designated Master or Buddy Leaves Active State During Move:

All blades in active state will be informed by the cluster handlerservice if any of the blades hosting the new master or new buddy leavethe active state. If this happens during the time span shown hatched inFIG. 11, i.e. if the remaining blades have not received CHANGE_MASTER bythen, they will abort the move and act as if MOVE_MASTER was neverreceived. If the information arrives after reception of CHANGE_MASTER,the move is considered successfully completed and normal recoveryactions at outage of the master are taken.

Broadcast or Multicast not Possible:

If MOVE_MASTER has been sent already, and broadcast or multicast ofNOT_MOVED or CHANGE_MASTER is not possible, the coordinator will detecttimeout of move operation and the handling described above applies.Incapability of moving mastership can in the long run reduce thecapacity and/or connectivity of the node. The system will recover fromthis condition as soon as communication is possible again.

Move of Buddy

General

In order to balance the processor and inter-blade signaling load, it canbecome necessary to move the buddy role for an individual route, PRA orMGw to a different blade. Move of buddy is only possible if at leastthree blades are in active state: One for the master, one for thecurrent buddy role and another one as target of the buddy move.

On the blade that hosts the master new calls can not be established forthe respective route/PRA as long as the buddy move is ongoing. Thereason is that otherwise, the circuit/channel state can not be keptredundant on two different blades. The move of MGw buddy does not leadto any traffic disturbance.

The coordinator will detect that a blade leaves active state and willtrigger moving of any master or buddy roles, which that blade hosts, toother blades. If there is no blade in active state that the buddy can bemoved to, then the old buddy will cease to exist and the role of buddywill become vacant.

Any sequence to move the buddy to a different blade must be robustagainst unavailability of any blade at any given time. The groupcommunication service provides means to get a positive confirmation thatall intended receiver blades have received a certain message. A bladereturning to active state will receive the latest allocation informationfrom the coordinator with ALLOCATION_TABLE message.

In order to reduce the number of potential error scenarios, the numberof messages sent between blades is kept to a minimum.

Successful Move of Buddyship

FIG. 12 shows the message sequence without interfering service requestsor fault scenarios.

Step 1: The blade which has been in active state for the longest time(coordinator) determines which buddy should be moved and whichdestination is should be moved to. It then triggers the procedure bymulticasting MOVE_BUDDY message to all blades in active state.

Step 2: The blade where the master resides compiles all data, which thenew buddy needs and sends it in UPDATE_BUDDY message to the designatedbuddy.

Step 3: The master must take care that ongoing processes do not impactdata to be transferred to the new buddy; otherwise the new buddy wouldmiss the related information. Such requests are only originating fromthe call controller on the same blade. The blade the master resides onwill buffer such seizure or release requests and not send any relatedupdate messages to the buddy between reception of MOVE_BUDDY andCHANGE_BUDDY to the buddy blade.

Step 4: The service instance on the new buddy blade then multicastsCHANGE_BUDDY message to all blades in active state. The old buddy bladetakes CHANGE_BUDDY as indication that the blade has lost the buddy role.It deletes all buddy data that was kept in case the move would beunsuccessful.

Step 5: When the master blade receives the CHANGE_BUDDY message, itstarts processing of service requests from the own call controller. Itsends UPDATE_BUDDY message to the new buddy blade for any changed CICstate.

Failure Scenarios During Move of Buddy Role

The principle is that at any time, all blades have sufficientinformation to determine if the move is still ongoing, or if itterminated successfully or not. FIG. 13 shows the move related statemachine that is maintained on each active blade for all buddies. Thetransitions are triggered either by sending or reception of the namedmessages or by blade state changes.

All blades in active state will be informed by the cluster handlerservice if any of the blades hosting the master or new buddy leave theactive state. If this happens during the time span shown hatched in FIG.14, i.e. if the remaining blades have not received CHANGE_BUDDY by then,they will abort the move and act as if MOVE_BUDDY was never received. Ifthe information arrives after reception of CHANGE_BUDDY, the move isconsidered successfully completed and normal recovery actions at outageof the buddy are taken.

In the following the possibilities for each role that a blade can hostare discussed.

Timeout of Move Operation

Every blade runs time supervision of every ongoing move operation. Attimeout the coordinator will try to create a new buddy by repeating theprocedure starting with MOVE_BUDDY. The master will know that theongoing move failed when it receives BUDDY_NOT_MOVED or when it receivesMOVE_BUDDY without having received BUDDY_NOT_MOVED or CHANGE_BUDDYbefore. There is no need to disconnect any calls since the informationthat shall be sent to the buddy is still buffered by the master and theold buddy.

Coordinator Lost:

Should the coordinator move (under conditions as described above) at anytime before reception of CHANGE_BUDDY, there would be no impact on thesequence of move. All blades in active state have sufficient informationto take over the coordinator role at any time. The remaining blade thathas been for the longest time in active state will resume coordinationrole. It will be aware of the ongoing move, since it received theMOVE_BUDDY message in the same way as all others did. It will use thealready started supervision timers on the own blade for the ongoing moveoperations.

New Blade Joins Active State During Move:

A blade that wants to join active state will get the current status andallocation of masters and buddies from the coordinator blade withALLOCATION_TABLE message. It will know if a move is ongoing and will beincluded in the recipients list of CHANGE_BUDDY, because the new buddyis made aware of the state change.

Other Blade Changes State During Move:

The fact that a blade that does neither host the master nor thedesignated buddy has changed the blade state does not affect the move.

Old Buddy not Available at Start of Move:

The sequence is the same as if the buddy would be available.

Old Buddy Lost During Move:

If the old buddy leaves active state, the move will continue unaffected.Should the move fail, the buddy role will be vacant. The coordinatorwill then try to assign a new buddy.

Designated Buddy Lost During Move:

All blades will be informed if the blade hosting the designated buddyleaves active state. If they have not received CHANGE_BUDDY by then,they will act as if no move was ever attempted. If the informationarrives after reception of CHANGE_BUDDY, normal recovery actions atoutage of the buddy are taken, i.e. a new buddy will be created by thecoordinator.

Master Lost During Move:

All blades will be informed if the blade hosting the master leavesactive state. If the master becomes unavailable at any time beforeCHANGE_BUDDY was sent, then the buddy move is aborted and the bladeswill act as if no move was ever attempted.

Broadcast or Multicast not Possible:

If MOVE_BUDDY has been sent already, and broadcast or multicast ofCHANGE_BUDDY is not possible, the coordinator will detect timeout ofmove operation and the handling described above applies. The system willrecover from this condition as soon as communication is possible again.

Summarizing, the invention allows a scalable blade system to allocateobject instances which coordinate common resources to individual blades.Allocation is done in a dynamic way that adapts to change of bladestates and to change of number of blades. Redundancy of information isguaranteed at any time.

What is claimed is:
 1. A switching center server comprising: a bladecluster including a plurality of blades that have access to a pluralityof resource pools for handling a call, wherein resources in any givenone of the resource pools comprise resources at a media gateway that areswitched under the control of the switching center server; and a masterfor each resource pool, each master provided on one of the blades andconfigured to centrally coordinate the blades' use of resources in thecorresponding resource pool.
 2. The switching center server according toclaim 1, wherein two different blades provide information about the usedresources for said call.
 3. The switching center server according toclaim 1, further comprising a call controller provided on one of theblades and configured to control resources for said call.
 4. Theswitching center server according to claim 3, further comprising a buddyfor one of the masters and residing on a different blade than thecorresponding master, the buddy containing the information about theresources controlled by a call controller residing on the same blade asthe master.
 5. The switching center server according to claim 4, furthercomprising a coordinator configured, if a blade fails, to: create atleast one of a new master as a replacement for a master present on thefailed blade and a new buddy as a replacement for a buddy present on thefailed blade; and allocate the new master, if created, to a first bladein said blade cluster; and allocate the new buddy, if created, to asecond blade in said blade cluster.
 6. The switching center serveraccording to claim 5, wherein, if the coordinator creates a new masteron the first new blade, the other blades transmit a list of usedresources for said call to the new master.
 7. The switching centerserver according claim 5, wherein the coordinator detects the signalingload of the blades and moves the masters and buddies for differentresource pools to different blades depending on the signaling load ofthe different blades.
 8. The switching center server according to claim1, wherein each blade further comprises a blade status information unitconfigured to determine the status of the blade and to inform the otherblades of any blade status changes.
 9. The switching center serveraccording to claim 1, wherein each blade comprises a blade recovery unitconfigured, if the blade fails, to carry out a blade recovery procedure,the blade recovery unit configured to decide which calls handled by thefailed blade to retain and to transmit information indicating theresources used for those calls to the corresponding master.
 10. Theswitching center server according to claim 1, wherein each bladecomprises a group communication service unit configured to controldelivery of messages to other blades, the messages being delivered toeach blade in the same order.
 11. The switching center server accordingto claim 1, comprising a route master for each route of a trunk, or anaccess master for each Integrated Digital Service Network (ISDN) access.12. The switching center server according to claim 11, furthercomprising a call controller provided on one of the blades andconfigured to control resources for said call, requesting control overresources from the route master or access master and returning controlwhen the resources are no longer needed.
 13. The switching center serveraccording to claim 1, further comprising a media gateway masterconfigured to control handling of maintenance messages of a mediagateway.
 14. A method for controlling a switching center server, theserver having a blade cluster with a plurality of blades, wherein theplurality of blades have access to a plurality of resource pools forhandling a call, wherein resources in any given one of the resourcepools comprise resources at a media gateway that are switched under thecontrol of the switching center server, the method comprising, for eachresource pool, coordinating the blades' use of resources in the pool ata master dedicated to that pool.
 15. The method according to claim 14,wherein the switching center server comprises a route master for eachroute of a trunk, or an access master for each Integrated DigitalService Network (ISDN) access, and further comprises a call controllerconfigured to control resources for a call, and wherein the methodfurther comprises performing at the call controller at least one of:setting up said call, supervising said call, disconnecting said call,and requesting control over resources from the route master or accessmaster, and returning control when the resources are no longer needed.16. The method according to claim 15, wherein the method comprisesproviding information about the used resources present on a first bladewhere the call controller resides on a second blade.
 17. The methodaccording to claim 14, further comprising detecting a status change ofat least one of the blades, and, if such a change is detected, informingthe other blades of that change.
 18. The method according to claim 14,further comprising detecting failure of a blade, and detecting whether arecovery procedure is carried out for the failed blade, wherein therecovery procedure retains calls handled by the failed blade andcontinues to use the resources for such call controlled by the failedblade.
 19. The method according to claim 14, further comprising:detecting failure of a blade, and detecting whether a recovery procedureis carried out for the failed blade, wherein the recovery proceduretransmits information to the corresponding master indicating resourcesused by the failed blade for calls not retained upon recovery, therebyenabling the master to reset those resources.
 20. The method accordingto claim 14, further comprising: detecting failure of a blade on which amaster is present; creating a new master on a new blade as a replacementfor the master present on the failed blade; and transmitting, from eachof the other blades to the new master, a first list of resources used bythe other blade.
 21. The method according to claim 20, wherein a callcontroller resides on the failed blade, said method further comprising:transmitting, from a buddy for the master on the failed blade to saidnew master, a second list of resources used by the master on the failedblade.
 22. The method according to claim 21, further comprisingresetting resources not present on said first or second lists ofresources.
 23. The method according to claim 22, wherein resettingresources not present on said first or second lists of resources isperformed when no recovery procedure is performed that may result incontinuous use of the resources.
 24. The method according to claim 14,further comprising: detecting whether more than one blade is in anactive state; and if so, creating a buddy on a first one of the bladesfor a master on a second one of the blades.
 25. The method according toclaim 14, further comprising: detecting failure of a blade on which amaster is present; creating a new master on a new blade, as areplacement for the master present on the failed blade; and creating anew buddy for the new master.
 26. The method according to claim 14,further comprising: detecting failure of a blade on which a buddy ispresent; creating a new buddy on a new blade, as a replacement for thebuddy present on the failed blade.
 27. The method according to claim 14,wherein the switching center server further comprise a coordinator, andwherein the method further comprises: detecting failure of a blade onwhich a master is present; creating a new master on a new blade, as areplacement for the master present on the failed blade, said creationcomprising at least one of: determining, by the coordinator, on whichblade the new master is created, transmitting, from the coordinator toother blades, information indicating that the new master is beingcreated, building, by the new master, a status table of resources usedby each blade, transmitting, from the other blades to the new master,information needed by the new master for coordinating the blades' usageof the pooled resources, transferring, from said new master to a buddy,a copy of data related to calls controlled by said new blade,transmitting, from said buddy to said new master, information indicatingthat that the buddy has successfully stored said data, transmitting,from the new master to the other blades, information indicating thatcreation of the new master is completed.
 28. The method according toclaim 27, further comprising buffering seizure requests for resourcesreceived during migration of the master and, after completion of thetransfer, transmitting the buffered seizure requests to the new master.29. The method according to claim 28, further comprising: detectingfailure of a blade on which the new master is provided before completionof the migration; and responsive to said detection, aborting themigration of the master.
 30. The method according to claim 14, whereinthe switching center server further comprise a buddy for the master anda coordinator, and wherein the method further comprises: detectingfailure of the blade on which said buddy is present, determining at thecoordinator to which blade the buddy should be migrated, and creating anew buddy on that blade, transmitting from the master to the new buddyall data needed by the new buddy, transmitting from the buddy to otherblades information that informs the other blades that the buddy has beenmigrated to the new buddy, and sending from the master to the new buddy,after the master has been informed of the transfer, informationindicating changed seizure states.
 31. The method according to claim 14,wherein the switching center server further comprises a buddy for themaster and a coordinator, wherein the coordinator is configured tocreate at least one of a new master and new buddy when a blade fails,and wherein the method comprises moving said coordinator from a firstblade to a second blade without changing the coordinator's control overthe creation of said new master or new buddy.
 32. The method accordingto claim 14, wherein the switching center server further comprisesbuddies for one or more masters, and wherein the method furthercomprises: detecting activation of a new blade, and transmitting fromanother blade to the new active blade the current status and theallocation of masters and buddies.